A note on optimality conditions to interval optimization problems
نویسندگان
چکیده
In this article we examine to necessary and sufficient optimality conditions for interval optimization problems. We introduce a new concept of stationary point for an interval-valued function based on the gH-derivative. We show the importance the this concept from a practical and computational point of view. We introduce a new concept of invexity for gH-differentiable interval-valued function which generalizes previous concepts and we prove that it is a sufficient optimality condition. Finally, we show that the concepts of differentiability, convexity and invexity for interval-valued functions based on the differentiability, convexity and invexity of its endpoint functions are not adequate tools for interval optimization problems.
منابع مشابه
Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملRegularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz. Necessary optimality conditions and regularity conditions are given. Our approach are based on the Michel-Penot subdifferential.
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کامل